In view of the problem that data for Named Data Networking (NDN) cache is replaced efficiently, a new replacement policy that considered popularity and request cost of data was proposed in this paper. It dynamically allocated proportion of popularity factor and request cost factor according to the interval time between the two requests of the same data. Therefore, nodes would cache data with high popularity and request cost. Users could get data from local node when requesting data next time, so it could reduce the response time of data request and reduce link congestion. The simulation results show that the proposed replacement policy can efficiently improve the in-network hit rate, reduce the delay and distance for users to fetch data.